On the computational hardness of the code equivalence problem in cryptography

Code equivalence is a well-known concept in coding theory. Recently, literature saw an increased interest this notion, due to the introduction of protocols based on hardness finding between two linear codes. In paper, we analyze security code equivalence, with special focus hardest instances, cryptographic usage. Our work stems from thorough review existing literature, identifies various types solvers for problem, and provides precise complexity analysis, where previously absent. Furthermore, are able improve state art, providing more efficient algorithm variations, which include numerical simulation data. end, goal paper provide complete, single point access, can be used as tool designing schemes that rely problem.